home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.lang.c++
- Path: cix.compulink.co.uk!usenet
- From: henri@cix.compulink.co.uk ("Henry Andrew")
- Subject: Re: Fastest way to index thru an array????
- Message-ID: <DL68ow.MyG@cix.compulink.co.uk>
- Organization: Compulink Information eXchange
- References: <30F6B0F6.75E3@imsisoft.com>
- Date: Sun, 14 Jan 1996 12:43:44 GMT
- X-News-Software: Ameol32
-
- There is only one way to tell how fast something is and that is to time
- it. I was sure I knew the fastest way to work with arrays and I was just
- about to tell everyone about it (at work) when it occurred to me to try
- it. On HP/UX and Digital Alpha (OSF1) I was right (by a very big margin)
- but on AIX CSet++ I was wrong. I looked at the asm for all three and was
- very surprised. I did not send my note.
-
- Yours &c. Henry
-
- > Ari Lukumies wrote:
- > > Ashutosh Gokhale <ashutosh> wrote:
- > >
- > > >Suppose I have an array A[][][] which I declare as
- > > > double ***A and then assign memory to it using new operator.
- > > >Now consider that A has dimensions A[50][60][70]. Then I can index
- > > thru ALL
- > > >entries of A using[...]
- > > Try this:
-
- [stuff cut]
-
- > > Later,
- > > AriL
- > >
- > > All my opinions are mine and mine alone.
- >
- > Oh yeah!
- >
- > Victor.
-